On Nonredundant Cost-Constrained Team Formation
نویسندگان
چکیده
Due to thewideapplicationof the taskassignmenton the internet, teamformationproblemhas becomeanimportantresearchissue.ArecentlyproposedproblemClusterHireaimstofindateam ofexperts toaccomplishmultipleprojectswhichcanharvest amaximumprofitundera limited budget.However,thereexistredundanciesintheteamyieldedbyexistingalgorithms.Thispaper firststudiesthepropertiesoftheproblem,andgivetwopruningstrategiesbasedonthem.Secondly, aredundancy-eliminatingstrategyandateam-augmentingstrategyareproposed.Inaddition,anew algorithmforgeneratingaprofit-maximizingteamisalsoproposed.Itisbasedontheredundancyeliminatingandteam-augmentingstrategies.Theexperimentalevaluationsshowthatourproposed strategiesandalgorithmsareeffective. KeyWORDS Cluster Hire, Expert-Skill-Project Tripartite Graph, Set Cover, Task Assignment, Team Formation
منابع مشابه
Multi-robot formation control and object transport in dynamic environments via constrained optimization
We present a constrained optimization method for multi-robot formation control in dynamic environments, where the robots adjust the parameters of the formation, such as size and three-dimensional orientation, to avoid collisions with static and moving obstacles, and to make progress towards their goal. We describe two variants of the algorithm, one for local motion planning and one for global p...
متن کاملAn improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملPattern search in the presence of degeneracy
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that conforms to the geometry of any nearby linear constraints. This set is then used to construct trial points to be evaluated during the iteration. In previous work, Lewis and Torczon developed a scheme for computing the co...
متن کاملPattern Search Methods in the Presence of Degeneracy
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that conforms to the geometry of any nearby linear constraints. This set is then used to construct trial points to be evaluated during the iteration. In previous work, Lewis and Torczon developed a scheme for computing the co...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJDWM
دوره 13 شماره
صفحات -
تاریخ انتشار 2017